Optimization of time-dependent queueing systems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Optimization of Queueing Systems

This paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers, or service capacity, to queues in a network; (ii) the optimal allocation of the visits of a single server to several queues (a polling system); (iii) the optimal allocation of a single arrival stream to several ...

متن کامل

Server optimization of infinite queueing systems

The problem of optimizing Markovian models with infinitely or finite but infeasible large state space is considered. In several practically interesting cases the state space of the model is finite and extremely large or infinite, and the transition and decision structures have some regular property which can be exploited for efficient analysis and optimization. Among the Markovian models with r...

متن کامل

Delay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems

In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...

متن کامل

State-dependent M/G/1 queueing systems

We consider a state-dependent Mn/Gn/1 queueing system with both finite and infinite buffer sizes. We allow the arrival rate of customers to depend on the number of people in the system. Service times are also statedependent and service rates can be modified at both arrivals and departures of customers. We show that the steady-state solution of this system at arbitrary times can be derived using...

متن کامل

Computing time dependent waiting time probabilities in nonstationary Markovian queueing systems

In this paper we present algorithms that compute, exactly or approximately, time dependent waiting time tail probabilities and time dependent expected waiting time in M(t)/M/s(t) queueing systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 2022

ISSN: ['1572-9443', '0257-0130']

DOI: https://doi.org/10.1007/s11134-022-09759-6